Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
نویسندگان
چکیده
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach re stricted to finite lattices (or lattices satisfying the chain condition).
منابع مشابه
Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach re stricted to finite lattices (or lattices satisfying the chain condition).
متن کاملWidening and narrowing operators for abstract interpretation
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of software, is based on two main key-concepts: the correspondence between concrete and abstract semantics through Galois connections/insertions, and the feasibility of a fixed point computation of the abstract semantics, through the fast convergence of widening operators. The latter point is crucial...
متن کاملAutomated formal analysis and verification: an overview
interpretation (Cousot and Cousot 1977) is a theory of a sound approximation of the semantics of computer programs that, among other applications, allows for constructing static analyses sound by construction. Abstract interpretation consists in giving a class of programs a concrete and abstract semantics defined on suitable concrete and abstract lattice-based domains. These domains are usually...
متن کاملA Galois Connection Calculus for Abstract Interpretation (Auxiliary Materials)
We introduce a Galois connection calculus for language independent specification of abstract interpretations used in programming language semantics, formal verification, and static analysis. This Galois connection calculus and its type system are typed by abstract interpretation.
متن کاملA minimalistic look at widening operators
We consider the problem of formalizing in higher-order logic the familiar notion of widening from abstract interpretation. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving correctness. After keeping only useful axioms, we give an equivalent characterization of widening as a lazily constructed wellfounded tree. In type systems supportin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992